Propositional Identity and Logical Necessity
نویسندگان
چکیده
منابع مشابه
Propositional Identity and Logical Necessity
In two early papers, Max Cresswell constructed two formal logics of propositional identity, and , which he observed to be respectively deductively equivalent to modal logics 4 and 5. Cresswell argued informally that these equivalences respectively “give . . . evidence” for the correctness of 4 and 5 as logics of broadly logical necessity. In this paper, I describe weaker propositiona...
متن کاملPropositional Manifolds And Logical Cohomology
In this note, we outline a definition of propositional manifold and logical cohomology. An application is also considered for mathematics, two Boole algebras of mathematical propositions are non equivalent if their two cohomologies are not isomorphic.
متن کاملLogical Closure Properties of Propositional Proof Systems
In this paper we define and investigate basic logical closure properties of propositional proof systems such as closure of arbitrary proof systems under modus ponens or substitutions. As our main result we obtain a purely logical characterization of the degrees of schematic extensions of EF in terms of a simple combination of these properties. This result underlines the empirical evidence that ...
متن کاملTowards logical operations research - propositional case
Tautology is interpreted as a necessary condition for the workability of an operations system. This condition suggests the following possibilities: the stable solvability of balance equations between available resources and requests for them; the calculation of potential and kinetic of the system together with the estimation of the contribution of every operation to the kinetic of the system; t...
متن کاملA Concurrent Logical Framework: The Propositional Fragment
We present the propositional fragment CLF0 of the Concurrent Logical Framework (CLF). CLF extends the Linear Logical Framework to allow the natural representation of concurrent computations in an object language. The underlying type theory uses monadic types to segregate values from computations. This separation leads to a tractable notion of definitional equality that identifies computations d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Australasian Journal of Logic
سال: 2004
ISSN: 1448-5052
DOI: 10.26686/ajl.v2i0.1763